On the alternating direction method of multipliers for nonnegative inverse eigenvalue problems with partial eigendata
نویسندگان
چکیده
We consider the nonnegative inverse eigenvalue problem with partial eigendata, which aims to find a nonnegative matrix such that it is nearest to a pre-estimated nonnegative matrix and satisfies the prescribed eigendata. In this paper, we propose several iterative schemes based on the alternating direction method of multipliers for solving the nonnegative inverse problem. We also extend our schemes to the symmetric case and the cases of prescribed lower bounds and of prescribed entries. Numerical tests (including a practical engineering application in vibrations) show the efficiency of the proposed iterative schemes.
منابع مشابه
Semidefinite inverse eigenvalue problems with prescribed entries and partial eigendata
In this paper, we study the semidefinite inverse eigenvalue problem of reconstructing a real n-by-n matrix C such that it is nearest to the original pre-estimated real n-by-n matrix Co in the Frobenius norm and satisfies the measured partial eigendata, where the required matrix C should preserve the symmetry, positive semidefiniteness, and the prescribed entries of the preestimated matrix Co. W...
متن کاملNonnegative inverse eigenvalue problems with partial eigendata
In this paper we consider the inverse problem of constructing an n-by-n real nonnegative matrix A from the prescribed partial eigendata. We first give the solvability conditions for the inverse problem without the nonnegative constraint and then discuss the associated best approximation problem. To find a nonnegative solution, we reformulate the inverse problem as a monotone complementarity pro...
متن کاملOn the nonnegative inverse eigenvalue problem of traditional matrices
In this paper, at first for a given set of real or complex numbers $sigma$ with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which $sigma$ is its spectrum. In continue we present some conditions for existence such nonnegative tridiagonal matrices.
متن کاملSymmetric Tridiagonal Inverse Quadratic Eigenvalue Problems with Partial Eigendata
In this paper we concern the inverse problem of constructing the n-by-n real symmetric tridiagonal matrices C and K so that the monic quadratic pencil Q(λ) := λI + λC + K (where I is the identity matrix) possesses the given partial eigendata. We first provide the sufficient and necessary conditions for the existence of an exact solution to the inverse problem from the self-conjugate set of pres...
متن کاملA Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Computational Applied Mathematics
دوره 239 شماره
صفحات -
تاریخ انتشار 2013